. so c - ph ] 3 1 O ct 2 00 6 Vertex labeling and routing in expanded Apollonian networks

Vertex labeling and routing in expanded Apollonian networks

We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale-free, small-world, and highly clustered. We introduce a labeling of their nodes that allows one to determine a shortest path routing between any two nodes of the network based only on the labels. PACS numbers: 02.10.Ox, 89.20.Ff, 89.75.D...

Compact Routing on Chordal Rings of Degree Four yLata

A chordal ring G(n; c) of degree 4 is a ring of n nodes with chords connecting each vertex i to the vertex (i + c) mod n. In this paper, we investigate compact routing schemes on such networks. We show a routing scheme for any such network that requires O(log n) bits of storage at each node, and O(1) time to compute a shortest path to any destination. This improves on the results of 16] which g...

RTES-03 Interfaces.indd

[ B ur ns 20 07 ] B u rn s, A & W el lin gs , A C o n cu rr en t a n d R ea l-T im e Pr o gr am m in g in A d a, e d it io n C am b ri d ge U n iv er si ty P re ss 2 00 7 [ M o to ro la 19 96 ] M o to ro la Ti m e Pr o ce ss in g U n it R ef er en ce M an u al 1 99 6 p p . 1 -1 42 [ M o to ro la 20 00 ] M o to ro la M PC 56 5 & M PC 56 6 2 00 0 p p . 1 -1 31 2 [ P ea co ck 19 97 ] Pe ac o ck , ...

s . so c - ph ] 4 O ct 2 00 5 Financial Markets and Persistence

Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs

In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can assign each vertex of an n-vertex UDG G a compact O(log n)-bit label such that, given the label of a source vertex and the label of a destination, it is possible to compute efficiently, based solely on these two labels, a neig...